Triangular decomposition of right coideal subalgebras

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Right Coideal Subalgebras

Let H be a character Hopf algebra. Every right coideal subalgebra that contains the coradical has a PBW-basis which can be extended up to a PBW-basis of H.

متن کامل

Coideal subalgebras in quantum affine algebras

We introduce two subalgebras in the type A quantum affine algebra which are coideals with respect to the Hopf algebra structure. In the classical limit q → 1 each subalgebra specializes to the enveloping algebra U(k), where k is a fixed point subalgebra of the loop algebra glN [λ, λ −1] with respect to a natural involution corresponding to the embedding of the orthogonal or symplectic Lie algeb...

متن کامل

Coideal Subalgebras and Quantum Symmetric Pairs

Coideal subalgebras of the quantized enveloping algebra are surveyed, with selected proofs included. The first half of the paper studies generators, Harish-Chandra modules, and associated quantum homogeneous spaces. The second half discusses various well known quantum coideal subalgebras and the implications of the abstract theory on these examples. The focus is on the locally finite part of th...

متن کامل

Right Coideal Subalgebras of Nichols Algebras and the Duflo Order on the Weyl Groupoid

We study graded right coideal subalgebras of Nichols algebras of semisimple Yetter-Drinfeld modules. Assuming that the Yetter-Drinfeld module admits all reflections and the Nichols algebra is decomposable, we construct an injective order preserving and order reflecting map between morphisms of the Weyl groupoid and graded right coideal subalgebras of the Nichols algebra. Here morphisms are orde...

متن کامل

Hierarchical Comprehensive Triangular Decomposition

The concept of comprehensive triangular decomposition (CTD) was first introduced by Chen et al. in their CASC’2007 paper and could be viewed as an analogue of comprehensive Gröbner systems for parametric polynomial systems. The first complete algorithm for computing CTD was also proposed in that paper and implemented in the RegularChains library in Maple. Following our previous work on generic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2010

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2010.01.022